Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard

نویسندگان

  • Jeffrey Bosboom
  • Erik D. Demaine
  • Martin L. Demaine
  • Adam Hesterberg
  • Pasin Manurangsi
  • Anak Yodpinyanee
چکیده

Jigsaw puzzles [9] and edge-matching puzzles [5] are two ancient types of puzzle, going back to the 1760s and 1890s, respectively. Jigsaw puzzles involve fitting together a given set of pieces (usually via translation and rotation) into a desired shape (usually a rectangle), often revealing a known image or pattern. The pieces are typically squares with a pocket cut out of or a tab attached to each side, except for boundary pieces which have one flat side and corner pieces which have two flat sides. Most jigsaw puzzles have unique tab/pocket pairs that fit together, but we consider the generalization to “ambiguous mates” where multiple tabs and pockets have the same shape and are thus compatible. Edge-matching puzzles are similar to jigsaw puzzles: they too feature square tiles, but instead of pockets or tabs, each edge has a color or pattern. In signed edge-matching puzzles, the edge labels come in complementary pairs (e.g., the head and tail halves of a colored lizard), and adjacent tiles must have complementary edge labels on their shared edge (e.g., forming an entire lizard of one color). This puzzle type is essentially identical to jigsaw puzzles, where complementary pairs of edge labels act as identically shaped tab/pocket pairs. In unsigned edge-matching puzzles, edge labels are arbitrary, and the requirement is that adjacent tiles must have identical edge labels. In both cases, the goal is to place (via translation and rotation) the tiles into a target shape, typically a rectangle. A recent popular (unsigned) edge-matching puzzle is Eternity II [8], which featured a US$2,000,000 prize for the first solver (before 2011). The puzzle remains unsolved (except presumably by its creator, Christopher Monckton). The best partial solution to date [7] either places 247 out of the 256 pieces without error, or places all 256 pieces while correctly matching 467 out of 480 edges.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Even $1 \times n$ Edge-Matching and Jigsaw Puzzles are Really Hard

We prove the computational intractability of rotating and placing n square tiles into a 1×n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-hard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying the...

متن کامل

Edge-Matching and Jigsaw Puzzles are Really Hard

We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NPhard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying th...

متن کامل

No Easy Puzzles: A Hardness Result for Jigsaw Puzzles

We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.

متن کامل

A Global Approach for Solving Edge-Matching Puzzles

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solvi...

متن کامل

Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and ComplexityA preliminary version of this paper was presented at the Gathering for Gardner 6, Atlanta, March 2004

We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1701.00146  شماره 

صفحات  -

تاریخ انتشار 2017